Chromatic nonsymmetric polynomials of Dyck graphs are slide-positive

نویسندگان

چکیده

Motivated by the study of Macdonald polynomials, J. Haglund and A. Wilson introduced a nonsymmetric polynomial analogue chromatic quasisymmetric function called chromatic polynomial Dyck graph. We give positive expansion for this in basis fundamental slide polynomials using recent work Assaf-Bergeron on flagged ( P , ρ stretchy="false">) (P,\rho ) -partitions. then derive known graphs terms Gessel’s taking backstable limit our expansion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs

In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...

متن کامل

Chromatic polynomials of random graphs

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009New J. Phys. 11 023001) nowmake it possible to compute chromatic polynomia...

متن کامل

Some Families of Graphs whose Domination Polynomials are Unimodal

Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, x)=sum_{i=gamma(G)}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$ and $gamma(G)$ is the domination number of $G$. In this paper we present some families of graphs whose domination polynomials are unimodal.

متن کامل

Chromatic polynomials and toroidal graphs

The chromatic polynomials of some families of quadrangulations of the torus can be found explicitly. The method, known as ‘bracelet theory’ is based on a decomposition in terms of representations of the symmetric group. The results are particularly appropriate for studying the limit curves of the chromatic roots of these families. In this paper these techniques are applied to a family of quadra...

متن کامل

Chromatic polynomials of some nanostars

Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2022

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15664